A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations
نویسندگان
چکیده
We construct a family of Order-Regular matrices of size m×n such that m ∼ Ω ( 10 √ 33 n) . Previously Order-Regular matrices were known only for m ∼ O (√ 2 n) .
منابع مشابه
Unique Sink Orientations of Cubes
Subject of this thesis is the theory of unique sink orientations of cubes. Such orientations are suitable to model problems from different areas of combinatorial optimization. In particular, unique sink orientations are closely related to the running time of the simplex algorithm. In the following, we try to answer three main questions: How can optimization problems be translated into the frame...
متن کاملA Strongly Polynomial Reduction for Linear Programs over Grids
We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with discounted Markov decision processes (MDPs). Through proposing reduction schemes for the GLCP, we obtain a strongly polynomial reduction from Grid-LPs to linear progr...
متن کاملPivoting in Linear Complementarity: Two Polynomial-Time Cases
We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty’s least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris’s highly cyclic P-LCP examples. We then show that on K-matrix LCP instances, all pivot rules require only a linear nu...
متن کاملAbout upper bounds on the complexity of Policy Iteration∗
We consider Acyclic Unique Sink Orientations of the n-dimensional hyper-cube (AUSOs), that is, acyclic orientations of the edges of the hyper-cube such that any sub-cube has a unique vertex of maximal in-degree. We study the Policy Iteration (PI) algorithm, also known as Bottom-Antipodal or Switch-All, to nd the global sink: starting from an initial vertex π0, i = 0, the outgoing links at the p...
متن کاملUnique Sink Orientations of Cubes
Suppose we are given (the edge graph of) an dimensional hypercube with its edges oriented so that every face has a unique sink. Such an orientation is called a unique sink orientation, and we are interested in finding the unique sink of the whole cube, when the orientation is given implicitly. The basic operation available is the socalled vertex evaluation, where we can access an arbitrary vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 44 شماره
صفحات -
تاریخ انتشار 2017